Fair E-Cash: Be Compact, Spend Faster

نویسندگان

  • Sébastien Canard
  • Cécile Delerablée
  • Aline Gouget
  • Emeline Hufschmitt
  • Fabien Laguillaumie
  • Hervé Sibert
  • Jacques Traoré
  • Damien Vergnaud
چکیده

We present the first fair e-cash system with a compact wallet that enables users to spend efficiently k coins while only sending to the merchant O(λ log k) bits, where λ is a security parameter. The best previously known schemes require to transmit data of size at least linear in the number of spent coins. This result is achieved thanks to a new way to use the Batch RSA technique and a tree-based representation of the wallet. Moreover, we give a variant of our scheme with a less compact wallet but where the computational complexity of the spend operation does not depend on the number of spent coins, instead of being linear at best in existing systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Practical Compact E-Cash

Compact e-cash schemes allow a user to withdraw a wallet containing k coins in a single operation, each of which the user can spend unlinkably. One big open problem for compact e-cash is to allow multiple denominations of coins to be spent efficiently without executing the spend protocol a number of times. In this paper, we give a (partial) solution to this open problem by introducing two addit...

متن کامل

Balancing Accountability and Privacy Using E-Cash (Extended Abstract)

In an electronic cash (e-cash) system, a user can withdraw coins from the bank, and then spend each coin anonymously and unlinkably. For some applications, it is desirable to set a limit on the dollar amounts of anonymous transactions. For example, governments require that large transactions be reported for tax purposes. In this work, we present the first e-cash system that makes this possible ...

متن کامل

Practical Compact E-Cash with Arbitrary Wallet Size

Compact e-cash schemes allow users to withdraw a wallet containing K coins and to spend each coin unlinkably. We present the first compact e-cash scheme with arbitrary wallet size k ≤ K while the spending protocol is of constant time and space complexity. Known compact e-cash schemes are constructed from either verifiable random functions or bounded accumulators. We use both building blocks to ...

متن کامل

Electronic Cash with Anonymous User Suspension

Electronic cash (E-cash) is the digital counterpart of cash payment. They allow users to spend anonymously unless they “double spend” their electronic coins. However, it is not possible to prevent users from misbehaving under some other subjective definitions of misbehavior, such as money laundering. One solution is to incorporate a trusted third party (TTP), which, upon complaint, uses its pow...

متن کامل

High-Level Programming for E-Cash

We consider symbolic characterizations of the Compact ECash protocol of Camenisch, Hohenberger, and Lysyanskaya [CHL05]. E-cash protocols [Cha82,CFN88] aim at providing robust abstractions for anonymous payment protocols. Properties of interest include, for instance, that users can spend coins anonymously, that users cannot forge coins, and that user should not spend the same coin twice without...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009